Three-connected graphs whose maximum nullity is at most three
نویسندگان
چکیده
منابع مشابه
On 3-Connected Graphs of Path-Width at Most Three
It is known that the list of excluded minors for the minor-closed class of graphs of path-width 6 3 numbers in the millions. However, if we restrict the class to 3-connected graphs of path-width 6 3, then we can characterize it by five excluded minors.
متن کاملChromaticity of Turan Graphs with At Most Three Edges Deleted
Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graph...
متن کاملGraphs with Branchwidth at Most Three
In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph as a minor. A set of four graphs is shown to be the obstruction set of graphs with branchwidth at mo...
متن کاملGraphs with Most Number of Three Point Induced Connected Subgraphs
Let G be a simple graph with e perfectly reliable edges and n nodes which fail independently and with the same probability ρ. The residual connectedness reliability R(G, ) ρ of G is the probability that the graph induced by the surviving nodes is connected. If Γ(n, e) is the collection of all n node e edge simple graphs, then G n e ∈Γ( , ) is uniformly most reliable if R G R G ( , ) ( , ) ρ ρ ≥...
متن کاملAll Connected Graphs with Maximum Degree at Most 3 whose Energies are Equal to the Number of Vertices
The energy E(G) of a graph G is defined as the sum of the absolute values of its eigenvalues. Let S2 be the star of order 2 (or K2) and Q be the graph obtained from S2 by attaching two pendent edges to each of the end vertices of S2. Majstorović et al. conjectured that S2, Q and the complete bipartite graphs K2,2 and K3,3 are the only 4 connected graphs with maximum degree ∆ ≤ 3 whose energies ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2008
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.03.018